Partitioning Sparse Rectangular Matrices for Parallel Processing?
نویسنده
چکیده
We are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. We will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. We will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods | the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.
منابع مشابه
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing
A common operation in scientific computing is the multiplication of a sparse, rectangular, or structurally unsymmetric matrix and a vector. In many applications the matrix-transposevector product is also required. This paper addresses the efficient parallelization of these operations. We show that the problem can be expressed in terms of partitioning bipartite graphs. We then introduce several ...
متن کاملPartitioning Sparse Rectangular Matrices for Parallel Computations of Ax and ATv
This paper addresses the problem of partitioning the nonzeros of sparse nonsymmetric and nonsquare matrices in order to e ciently compute parallel matrix-vector and matrix-transpose-vector multiplies. Our goal is to balance the work per processor while keeping communications costs low. Although the symmetric partitioning problem has been well-studied, the nonsymmetric and rectangular cases have...
متن کاملPermuting Sparse Rectangular Matrices into Block-Diagonal Form
We investigate the problem of permuting a sparse rectangular matrix into blockdiagonal form. Block-diagonal form of a matrix grants an inherent parallelism for solving the deriving problem, as recently investigated in the context of mathematical programming, LU factorization, and QR factorization. To represent the nonzero structure of a matrix, we propose bipartite graph and hypergraph models t...
متن کاملEncapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
This paper addresses the problem of one-dimensional partitioning of structurally unsymmetricsquare and rectangularsparse matrices for parallel matrix-vector and matrix-transpose-vector multiplies. The objectiveis to minimizethe communicationcost while maintainingthe balance on computational loads of processors. Most of the existing partitioning models consider only the total message volume hopi...
متن کامل